Algorithms for Learning Function Distinguishable Regular Languages
نویسندگان
چکیده
Function distinguishable languages were introduced as a new methodology of defining characterizable subclasses of the regular languages which are learnable from text. Here, we give details on the implementation and the analysis of the corresponding learning algorithms. We also discuss problems which might occur in practical applications.
منابع مشابه
Partially Distribution-Free Learning of Regular Languages from Positive Samples
Regular languages are widely used in NLP today in spite of their shortcomings. Efficient algorithms that can reliably learn these languages, and which must in realistic applications only use positive samples, are necessary. These languages are not learnable under traditional distribution free criteria. We claim that an appropriate learning framework is PAC learning where the distributions are c...
متن کاملLearning Optionality and Repetition
Adjuncts are syntactic elements that are optional, transparent to selection, and often, though not always, repeatable. Classic examples are adjectives and adverbs. How do learners learn optionaility? How do they learn repeatability? I explore a variety of learners’ approaches to optionality and repeatability, including both human learners and learning algorithms. Mathematically, a learner is a ...
متن کاملMeta-algorithm GENMODEL: Generalizing over three learning settings using observation tables
We present a learning algorithm for regular languages that unifies three existing ones for the settings of minimally adequate teacher learning, learning from membership queries and positive data, and learning from positive and negative data, respectively. We choose these three algorithms as an example to back up the conjecture that the learning process of every algorithm for the class of regula...
متن کاملLearning Local and Recognizable !-Languages and Monadic Logic Programs
We introduce two subclasses of regular !-languages called local !-languages and recognizable !-languages, and give two learning algorithms for those subclasses. We also relate these results to the learning problem for the class of monadic logic programs.
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کامل